#include <iostream>
#include <algorithm>
#include <vector>


using namespace std;

int n,m;
vector<int> v,find;
int main()
{
	cin >> n >> m;
	for(int i = 0; i < n; i ++)
	{
		int x;
		cin >> x;
		v.push_back(x);
	}
	while(m--)
	{
		int op;
		int L1;
		if(op==1)
		{
			cin >> L1;
			for(int i = 0;i < L1; i ++ )
			{
				int p;
				cin >> p;
				find.push_back(p);
			}
			cin >> L2;
			for(int i = 0;i < L2; i++ )
			{
				int p;
				cin >> p;
				tmp.push_back(p);
			}
			
		}
	}
	
	
	return 0;
 } 
